Non-intrusive Coupling: Recent Advances and Scalable Nonlinear Domain Decomposition
نویسندگان
چکیده
منابع مشابه
Non-intrusive coupling: recent advances and scalable nonlinear domain decomposition
This paper provides a detailed review of the global/local non-intrusive coupling algorithm. Such method allows to alter a global finite element model, without actually modifying its corresponding numerical operator. We also look into improvements of the initial algorithm (Quasi-Newton and dynamic relaxation), and provide comparisons based on several relevant test cases. Innovative examples and ...
متن کاملThe domain interface method: a general-purpose non-intrusive technique for non-conforming domain decomposition problems
A domain decomposition technique is proposed which is capable of properly connecting arbitrary non-conforming interfaces. The strategy essentially consists in considering a fictitious zero-width interface between the non-matching meshes which is discretized using a Delaunay triangulation. Continuity is satisfied across domains through normal and tangential stresses provided by the discretized i...
متن کاملNonlinear Overlapping Domain Decomposition Methods
We discuss some overlapping domain decomposition algorithms for solving sparse nonlinear system of equations arising from the discretization of partial differential equations. All algorithms are derived using the three basic algorithms: Newton for local or global nonlinear systems, Krylov for the linear Jacobian system inside Newton, and Schwarz for linear and/or nonlinear preconditioning. The ...
متن کاملIntrusive and non-intrusive watermarking
“Can we watermark without perturbing an image?” We present the salient results of the investigation carried out to find an answer to this question.
متن کاملHow Scalable is Domain Decomposition in Practice?
The convergence rates and, therefore, the overall parallel e ciencies of additive Schwarz methods are often dependent on subdomain granularity. Except when e ective coarse-grid operators and intergrid transfer operators are known, so that optimal multilevel preconditioners can be constructed, the number of iterations to convergence tends to increase with granularity for elliptically-controlled ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archives of Computational Methods in Engineering
سال: 2014
ISSN: 1134-3060,1886-1784
DOI: 10.1007/s11831-014-9132-x